Finite fields

Results: 995



#Item
231Algebraic techniques in parameterized algorithms, Part II: Polynomials over finite fields of characteristic two Lukasz Kowalik University of Warsaw  FPT School, Bedlewo, August 2014

Algebraic techniques in parameterized algorithms, Part II: Polynomials over finite fields of characteristic two Lukasz Kowalik University of Warsaw FPT School, Bedlewo, August 2014

Add to Reading List

Source URL: fptschool.mimuw.edu.pl

Language: English - Date: 2014-08-21 02:45:56
    232Pairing Friendly Elliptic Curves and Finite Fields Igor E. Shparlinski, Macquarie University We present some theoretic and heuristic estimates for the number of elliptic curves with low embedding which is essential for t

    Pairing Friendly Elliptic Curves and Finite Fields Igor E. Shparlinski, Macquarie University We present some theoretic and heuristic estimates for the number of elliptic curves with low embedding which is essential for t

    Add to Reading List

    Source URL: www.math.tugraz.at

    - Date: 2008-07-29 07:57:24
      233Microsoft Word - AcceptedPapers_ECC2015.docx

      Microsoft Word - AcceptedPapers_ECC2015.docx

      Add to Reading List

      Source URL: nist.gov

      Language: English - Date: 2015-05-18 12:17:18
      234Finiteness lengths of arithmetic groups over global function fields Ralf Gramlich An abstract group is said to be of type Fn , n ∈ N, if it admits a classifying space with a finite n-skeleton. It is of type F1 if and o

      Finiteness lengths of arithmetic groups over global function fields Ralf Gramlich An abstract group is said to be of type Fn , n ∈ N, if it admits a classifying space with a finite n-skeleton. It is of type F1 if and o

      Add to Reading List

      Source URL: perso.uclouvain.be

      Language: English - Date: 2009-02-01 11:04:23
        235CS255: Introduction to Cryptography  Winter 2015 Assignment #3: Solutions Problem 1. (a) We have eeve deve = 1 (mod ϕ(N )). Thus, ϕ(N ) divides eeve deve − 1.

        CS255: Introduction to Cryptography Winter 2015 Assignment #3: Solutions Problem 1. (a) We have eeve deve = 1 (mod ϕ(N )). Thus, ϕ(N ) divides eeve deve − 1.

        Add to Reading List

        Source URL: crypto.stanford.edu

        Language: English - Date: 2015-03-15 20:33:19
        236The discrete logarithm problem on elliptic curves of trace one

        The discrete logarithm problem on elliptic curves of trace one

        Add to Reading List

        Source URL: www.hpl.hp.com

        Language: English - Date: 2008-12-18 13:50:00
        237The Mathematics of Coding: Information, Compression, Error Correction, and Finite Fields

        The Mathematics of Coding: Information, Compression, Error Correction, and Finite Fields

        Add to Reading List

        Source URL: www.math.umn.edu

        Language: English - Date: 2007-10-17 12:13:25
        238CAVP 試験可能な暗号アルゴリズム一覧 () © 2014 ECSEC Laboratory Inc. 大分類 公開鍵 (FIPS

        CAVP 試験可能な暗号アルゴリズム一覧 () © 2014 ECSEC Laboratory Inc. 大分類 公開鍵 (FIPS

        Add to Reading List

        Source URL: www.ecsec.jp

        Language: English - Date: 2014-09-26 04:10:08
        239Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. Desmedt

        Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. Desmedt

        Add to Reading List

        Source URL: www.dtc.umn.edu

        Language: English - Date: 1998-04-13 22:10:00
        240Call For Papers - NIST Workshop on Elliptic Curve Cryptography Standards (June 2015)

        Call For Papers - NIST Workshop on Elliptic Curve Cryptography Standards (June 2015)

        Add to Reading List

        Source URL: nist.gov

        Language: English - Date: 2015-01-15 12:54:38